Extended interlacing intervals

Self-interlacing polynomials II: Matrices with self-interlacing spectrum

An n×n matrix is said to have a self-interlacing spectrum if its eigenvalues λk , k = 1, . . . ,n, are distributed as follows: λ1 >−λ2 > λ3 > · · ·> (−1)λn > 0. A method for constructing sign definite matrices with self-interlacing spectrum from totally nonnegative ones is presented. This method is applied to bidiagonal and tridiagonal matrices. In particular, a result by O. Holtz on the spectr...

Generalized Interlacing Inequalities

We discuss some applications of generalized interlacing inequalities of Ky Fan to the study of (a) some classical matrix inequalities and (b) matrix problems in quantum information science. AMS Classification 15A18, 15A57, 15A60, 15A90.

Polynomials , roots , and interlacing

Advanced de-interlacing techniques

This paper presents an overview of deinterlacing techniques and describes some advanced motion compensated de-interlacing techniques in more detail. These motion compensated methods are analyzed and mutually compared. It is concluded that the success of motion compensated de-interlacing depends critically on a protection mechanism. A good example is presented.

Interlacing Eigenvalues and Graphs

We give several old and some new applications of eigenvalue interlacing to matrices associated to graphs. Bounds are obtained for characteristic numbers of graphs, such as the size of a maximal (colclique, the chromatic number, the diameter, and the bandwidth, in terms of the eigenvalues of the Standard adjacency matrix or the Laplacian matrix. We also deal with inequalities and regularity resu...